Braided Convolutional Codes - A Class of Spatially Coupled Turbo-Like Codes

نویسندگان

  • Michael Lentmaier
  • Saeedeh Moloudi
  • Alexandre Graell i Amat
چکیده

In this paper, we investigate the impact of spatial coupling on the thresholds of turbo-like codes. Parallel concatenated and serially concatenated convolutional codes as well as braided convolutional codes (BCCs) are compared by means of an exact density evolution (DE) analysis for the binary erasure channel (BEC). We propose two extensions of the original BCC ensemble to improve its threshold and demonstrate that their BP thresholds approach the maximum-a-posteriori (MAP) threshold of the uncoupled ensemble. A comparison of the different ensembles shows that parallel concatenated ensembles can be outperformed by both serially concatenated and BCC ensembles, although they have the best BP thresholds in the uncoupled case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-user OFDM Based on Braided Convolutional Codes

Braided convolutional codes (BCCs) form a class of iteratively decodable convolutional codes that are constructed from component convolutional codes. In braided code division multiple access (BCDMA), these very efficient error correcting codes are combined with a multiple access method and inherent interleaving for channel diversity exploitation into one single scheme. In this paper, we describ...

متن کامل

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels

Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the “threshold saturation” effect whereby the belief-propagation (BP) threshold of the spatially-coupled ensemble is boosted to the maximum a-posteriori (MAP)...

متن کامل

An approach to fault detection and correction in design of systems using of Turbo ‎codes‎

We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...

متن کامل

Information-Coupled Turbo Codes for LTE Systems

We propose a new class of information-coupled (IC) Turbo codes to improve the transport block (TB) error rate performance for long-term evolution (LTE) systems, while keeping the hybrid automatic repeat request protocol and the Turbo decoder for each code block (CB) unchanged. In the proposed codes, every two consecutive CBs in a TB are coupled together by sharing a few common information bits....

متن کامل

Turbo Codes with Non-Systematic Constituent Codes∗

Turbo codes are usually constructed using systematic recursive convolutional codes (SRCC’s) as constituent codes. In this paper, we introduce a new class of turbo codes that uses nonsystematic recursive convolutional codes (NSRCC’s) as constituent codes. A systematic constituent code then becomes a particular case of this more general class. The use of this larger class of constituent codes enh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1407.0511  شماره 

صفحات  -

تاریخ انتشار 2014